The Lasserre hierarchy in Approximation algorithms Lecture Notes for the MAPSP 2013 Tutorial Preliminary version∗ Thomas Rothvoß June 24, 2013

Source URL: www.math.washington.edu

Approximation Algorithms Workshop June 13-17, 2011, Princeton Open Problems Session Scribe: Rajesh Chitnis

Source URL: www.cs.princeton.edu

Deterministic Sampling Algorithms for Network Design Anke van Zuylen Abstract For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample

Source URL: arvanzuijlen.people.wm.edu

MI Preprint Series Mathematics for Industry Kyushu University Exact and approximation algorithms for weighted matroid

Source URL: gcoe-mi.jp

Approximation Algorithms for Minimum-Width Annuli and Shells Pankaj K. Agarwal y

Source URL: www.math.tau.ac.il

CS261: A Second Course in Algorithms Lecture #17: Linear Programming and Approximation Algorithms∗ Tim Roughgarden† March 1, 2016

Source URL: theory.stanford.edu

Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals∗ Markus Bl¨aser1 Bodo Manthey2

Source URL: www-cc.cs.uni-saarland.de

• Mathematical analysis
• Mathematics
• Analysis
• Generalized functions
• Smooth functions
• Operations research
• Travelling salesman problem
• Distribution
• Limit of a function
• Approximation algorithm
• Convex function
• Euclidean algorithm

Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone:

Source URL: students.ceid.upatras.gr

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Logic in computer science
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Electronic design automation
• Symposium on Discrete Algorithms
• Approximation algorithm
• Random walk
• 2-satisfiability

Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n

Source URL: emarkou.users.uth.gr

• Graph theory
• Mathematics
• Computational complexity theory
• Operations research
• Combinatorial optimization
• Routing algorithms
• Search algorithms
• Edsger W. Dijkstra
• Travelling salesman problem
• A* search algorithm
• Flow network
• Tree traversal